topological_sort

Topological sort of a Bayesian network.

Topological sort of a Bayesian network

Bayesian network learning using the PCHC, FEDHC, MMHC and variants of these algorithms. PCHC stands for PC Hill-Climbing, a new hybrid algorithm that uses PC to construct the skeleton of the BN and then
applies the Hill-Climbing greedy search. More algorithms and variants have been added, such as MMHC, FEDHC, and the Tabu search variants, PCTABU, MMTABU and FEDTABU.
The relevant papers are:
a) Tsagris M. (2021). "A new scalable Bayesian network learning algorithm with applications to economics". Computational Economics, 57(1): 341-367. <doi:10.1007/s10614-020-10065-7>.
b) Tsagris M. (2022). "The FEDHC Bayesian Network Learning Algorithm". Mathematics 2022, 10(15): 2604. <doi:10.3390/math10152604>.

Michail Tsagris

pchc

Bayesian Network Learning with the PCHC and Related Algorithms

Topological sort of a Bayesian network function

<dl><dt>dag</dt>
<dd>A square matrix representing a directed graph which contains 0s and 1s. If G[i, j] = 1 it
means there is an arrow from node i to node j. When there is no edge between nodes i and j if G[i, j] = 0.</dd></dl>

Arguments

Michail Tsagris.
R implementation and documentation: Michail Tsagris <a href="/link/mtsagris%40uoc.gr?package=pchc&version=1.3" data-mini-rdoc="pchc::mtsagris@uoc.gr">mtsagris@uoc.gr</a>.

Author

Topological sort of a Bayesian network — Topological sort of a Bayesian network

<dl>

<dt>dag</dt>
<dd>A square matrix representing a directed graph which contains 0s and 1s. If G[i, j] = 1 it
means there is an arrow from node i to node j. When there is no edge between nodes i and j if G[i, j] = 0.</dd>

</dl>

Michail Tsagris.
R implementation and documentation: Michail Tsagris <a href='mailto:mtsagris@uoc.gr'>mtsagris@uoc.gr</a>.

Topological sort of a Bayesian network: Topological sort of a Bayesian network

Description

Usage

Value

Arguments

Author

Details

References

See Also

Examples